package easy;

public class a674_最长连续递增序列 {
    public int findLengthOfLCIS(int[] nums) {
        int start=0;
        int max=0;
        for(int i=0;i<nums.length;i++){
            if(i>0&&nums[i]<=nums[i-1]){
                start=i;
            }
            max=Math.max(max,i-start+1);
        }
        return max;
    }
}
